Non-commutative logic II: sequent calculus and phase semantics

نویسنده

  • Paul Ruet
چکیده

Non-commutative logic, which is an uniication of commutative linear logic and cyclic linear logic, is extended to all linear connectives: additives, exponentials and constants. We give two equivalent versions of the sequent calculus | directly with the structure of series-parallel order varieties, and with their presentations as partial orders |, phase semantics and a cut elimination theorem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partially commutative linear logic: sequent calculus and phase semantics

In this short paper we introduce a variant of intuitionistic multiplicative linear logic that features both commutative and non-commutative connectives. This new logic extends conservatively both Girard’s multiplicative linear logic [2] and Lambek’s syntactic calculus [3]. Ultimately, our goal will be to fulfil the programme achieved by Girard in [2], i.e., to provide our system with: (1) a seq...

متن کامل

Norihiro Kamide TEMPORAL NON - COMMUTATIVE LOGIC : Expressing time , resource , order and hierarchy

A first-order temporal non-commutative logic TN[l], which has no structural rules and has some l-bounded linear-time temporal operators, is introduced as a Gentzen-type sequent calculus. The logic TN[l] allows us to provide not only time-dependent, resource-sensitive, ordered, but also hierarchical reasoning. Decidability, cut-elimination and completeness (w.r.t. phase semantics) theorems are s...

متن کامل

The Undecidability of System NEL

System NEL is a conservative extension of multiplicative exponential linear logic (MELL) by a self-dual non-commutative connective called seq which lives between the par and the times. In this paper, I will show that system NEL is undecidable by encoding two counter machines into NEL. Although the encoding is quite simple, the proof of the faithfulness is a little intricate because there is no ...

متن کامل

A Non-commutative Extension of Classical Linear Logic

We extend the multiplicative fragment of linear logic with a non-commutative connective (called before), which, roughly speaking, corresponds to sequential composition. This lead us to a calculus where the conclusion of a proof is a Partially Ordered MultiSET of formulae. We rstly examine coherence semantics, where we introduce the before connective, and ordered products of formulae. Secondly w...

متن کامل

Relating Natural Deduction and Sequent Calculus for Intuitionistic Non-Commutative Linear Logic

We present a sequent calculus for intuitionistic non-commutative linear logic (INCLL), show that it satisfies cut elimination, and investigate its relationship to a natural deduction system for the logic. We show how normal natural deductions correspond to cut-free derivations, and arbitrary natural deductions to sequent derivations with cut. This gives us a syntactic proof of normalization for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematical Structures in Computer Science

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2000